Computer Science
A common tree with at most 2 children per node. At the root node, the value of the root node is greater than or equal to all the nodes of the left child, and it's less than the nodes in the right child. Traverse the tree by comparing the target value to the node - greater than, go right + down; less than, go left + down.
(ALGS201x)